package first.demo;

public class nHuanghou {
    
    public static void main(String[] args) {

    }
    
    public static int place(int k,int j){
        int i=1;
        int[] q=new int[20];
        while (i<k)
        {
            if(Math.abs(i-j)==Math.abs(q[i]-j) || i==j) 
                return 0;
            i++;
        }
        return 1;

    }
    
    public static void queen(int k,int n){
        int i;
        if(k>n)
            display(n);
        
    }

    private static void display(int n) {
    }
}

